Computation of similar titles based on position transition data in a social networking service

ABSTRACT

In an example, a granularity of title similarity is determined, wherein the granularity of title similarity is a level at which social networking data should be filtered to identify titles similar to a target title. Then a weighted graph of titles is constructed at the granularity of title similarity, wherein each node in the weighted graph is a title and a directed edge exists in the weighted graph between a first node and a second node if the social networking data, at the granularity of title similarity, indicates that a transition occurred wherein a member who held a position with a title corresponding to the first node transitioned to a position with a title corresponding to the second node, wherein each directed edge contains a weight indicating a strength of relationship between nodes. The weighted graph of locations is traversed from a node corresponding to the target title in order to identify titles similar to the target title.

TECHNICAL FIELD

The present disclosure generally relates to computer technology forsolving technical challenges in providing statistical insights based onconfidential data submitted in a computer system. More specifically, thepresent disclosure relates to computation of similar titles based onposition transition data in a social networking service.

BACKGROUND

In various types of computer systems, there may be a need to collect,maintain, and utilize confidential data. In some instances, users may bereluctant to share this confidential information over privacy concerns.These concerns extend not only to pure security concerns, such asconcerns over whether third parties such as hackers may gain access tothe confidential data, but also to how the computer system itself mayutilize the confidential data. With certain types of data, usersproviding the data may be somewhat comfortable with uses of the datathat maintain anonymity, such as the confidential data merely being usedto provide broad statistical analysis to other users.

One example of such confidential data is salary/compensationinformation. It may be desirable for a service such as a socialnetworking service to entice its members to provide information abouttheir salary or other work-related compensation in order to providemembers with insights into various metrics regardingsalary/compensation, such as an average salary for a particular job typein a particular city. There are technical challenges encountered,however, in providing various metrics to members. One particulartechnical challenge is that it can be difficult to determine locationsthat are similar to ones that the member already resides in (or isalready interested in). Common metrics for similarity between cities,such as population size, weather, etc., may or may not have relevancefor job searching. Additionally, locations may be considered similar forsome industries but not others. For example, Silicon Valley and Austinboth have fairly large software technology presences, but San Diego doesnot. Despite the fact that San Diego may have a similar population asSilicon Valley and similar weather, for the software industry Austin isactually a closer match to Silicon Valley than San Diego is.

Similar technical issues arise with titles and peer company groups.

BRIEF DESCRIPTION OF THE DRAWINGS

Some embodiments of the technology are illustrated, by way of exampleand not limitation, in the figures of the accompanying drawings.

FIG. 1 is a block diagram illustrating a confidential data collection,tracking, and usage system, in accordance with an example embodiment.

FIGS. 2A-2C are screen captures illustrating an example of a userinterface provided by a confidential data frontend, in accordance withan example embodiment.

FIG. 3 is a flow diagram illustrating a method for confidential datacollection and storage, in accordance with an example embodiment.

FIG. 4 is a diagram illustrating an example of a submission table, inaccordance with an example embodiment.

FIG. 5 is a flow diagram illustrating a method for confidential datacollection and storage, in accordance with an example embodiment.

FIGS. 6A-6C are screen captures illustrating a user interface fordisplaying insights to a first user from confidential data submitted byother users, in accordance with an example embodiment.

FIG. 7 is a flow diagram illustrating a method of determining similarlocations to a first location based on transition information in asocial networking service, in accordance with an example embodiment.

FIG. 8 is a flow diagram depicting a method for handling confidentialdata submitted by a user in a computer system, in accordance with anexample embodiment.

FIG. 9 is a flow diagram depicting a method for handling confidentialdata submitted by a user in a computer system, in accordance withanother example embodiment.

FIG. 10 is a flow diagram illustrating a method of determining similarcompanies to a target company based on transition information in asocial networking service, in accordance with an example embodiment.

FIG. 11 is a block diagram illustrating a representative softwarearchitecture, which may be used in conjunction with various hardwarearchitectures herein described.

FIG. 12 is a block diagram illustrating components of a machine,according to some example embodiments, able to read instructions from amachine-readable medium (e.g., a machine-readable storage medium) andperform any one or more of the methodologies discussed herein.

DETAILED DESCRIPTION

The present disclosure describes, among other things, methods, systems,and computer program products. In the following description, forpurposes of explanation, numerous specific details are set forth inorder to provide a thorough understanding of the various aspects ofdifferent embodiments of the present disclosure. It will be evident,however, to one skilled in the art, that the present disclosure may bepracticed without all of the specific details.

In an example embodiment, an architecture is provided that gathersconfidential information from users, tracks the submission of theconfidential information, and maintains and utilizes the confidentialinformation in a secure manner while ensuring that the confidentialinformation is accurate and reliable.

FIG. 1 is a block diagram illustrating a confidential data collection,tracking, and usage system 100, in accordance with an exampleembodiment. A client device 102 may utilize a confidential data frontend104 to submit confidential information to a confidential data backend106. In some example embodiments, the confidential data backend 106 islocated on a server-side or cloud platform 107 while the confidentialdata frontend 104 is directly connected to or embedded in the clientdevice 102. However, in some example embodiments, the confidential datafrontend 104 is also located on the server-side or cloud platform 107.

There may be various different potential implementations of theconfidential data frontend 104, depending upon the type andconfiguration of the client device 102. In an example embodiment, theconfidential data frontend 104 may be a web page that is served to a webbrowser operating on the client device 102. The web page may includevarious scripts, such as JavaScript code, in addition to HypertextMarkup Language (HTML) and Cascading Style Sheets (CSS) code designed toperform various tasks that will be described in more detail below. Theweb page may be served in response to the user selecting a link in aprevious communication or web page. For example, the link may bedisplayed in an email communication to the user, or as part of a feedsection of the user's social networking service member page. This allowsthe entity operating the confidential data collection, tracking, andusage system 100 to selectively target users to request that they submitconfidential information. For example, the entity may determine thatthere is a need to obtain more salary information for users from Kansasand then may send out communications to, or cause the social networkingservice to alter feeds of, users in a manner that allows the users toselect the link to launch the confidential data frontend 104.

In another example embodiment, the confidential data frontend 104 may bebuilt into an application installed on the client device 102, such as astandalone application running on a smartphone. Again this confidentialdata frontend 104 is designed to perform various tasks that will bedescribed in more detail below.

One task that the confidential data frontend 104 may be designed toperform is the gathering of confidential data from a user of the clientdevice 102. Another task that the confidential data frontend 104 may bedesigned to perform is to display insights from confidential datacontributed by other users. In order to incentivize users to providecertain types of confidential data, in an example embodiment, insightsfrom the confidential data contributed by other users are provided inresponse to the user contributing his or her own confidential data. Aswill be described in more detail, a mechanism to ensure that thecontribution of confidential data is tracked is provided.

Once the confidential data is received from the user, the confidentialdata frontend 104 may transmit the confidential data along with anidentification of the user (such as a member identification reflectingthe user's account with a social networking service) to the confidentialdata backend 106. In an example embodiment, this may be performed via,for example, a REST Application Program Interface (API).

The confidential data, along with the identification of the user, may bestored in a submission table by the confidential data backend 106 in aconfidential information database 108. In some example embodiments, thissubmission table may be encrypted in order to ensure security of theinformation in the submission table. Furthermore, in some exampleembodiments, the confidential data stored in the submission table may beencrypted using a different key than the identifying information in thesubmission table. This encryption will be described in more detailbelow.

In another example embodiment, a random transaction number is generatedfor each confidential data submission. This random transaction number isstored with the identifying information in one table, and then storedwith the confidential data in another table, with each table encryptedseparately using a different key. In either this example embodiment orthe previous example embodiment, encrypting the identifying informationseparately from the confidential data (either in one table or inseparate tables) provides added security against the possibility that amalicious user could gain access to one or the other. In other words,even if a malicious user gained access to the identifying informationby, for example, hacking the encryption used to encrypt the identifyinginformation, that would not allow the malicious user to gain access tothe confidential data corresponding to the identifying information, andvice versa. In an example embodiment, the encryption mechanism used isone that is non-deterministic, such that the same information encryptedtwice would produce different results in each encryption. In anotherexample embodiment, the transaction number itself is also encrypted,thereby preventing even the act of joining separate tables containingthe identifying information and the confidential data.

In an example embodiment, a submission table may also be able to trackwhen submissions were made by users. As such, the submission table mayinclude additional columns such as, for example, a submissionidentification, an identification of the user who made the submission,an encryption key for the submission, and timestamp information aboutwhen the submission was made. The submission table may then be utilizedby the confidential data backend 106 to determine, for example, when toshare insights from submissions from other users to a particular user.If, for example, the user has previously submitted confidential data andhas done so recently (e.g., within the last year), then the confidentialdata backend 106 may indicate to the confidential data frontend 104 thatit should share insights from confidential data from other users withthis particular user.

There may be other methods than those described above for determiningeligibility of a user for receiving insights from submissions from otherusers. For example, a predicate expressed in terms of one or moreattributes may need to be satisfied in order to receive the insights,such as particular demographic or profile-based attributes. Theseattributes can include any such attribute, from location, to title, tolevel of skill, to social networking service activities or status (e.g.,about to transition from being an active member to an inactive member),to transactional attributes (e.g., purchased a premium subscription).

Additionally, any combination of the above factors can be used todetermine whether the user is eligible for receiving insights fromsubmissions from other users.

Furthermore, the submission table may also include one or moreattributes of the user that made the submission. These attributes may beattributes that can be useful in determining a slice to which the userbelongs. Slices will be described in more detail below, but generallyinvolve a segment of users sharing common attributes, such as titles,locations, educational levels, and the like. It should be noted that itis not necessary for these attributes to be stored in the submissiontable. Since an identification of the user is available in thesubmission table, it may be possible to retrieve the attributes for theuser on an as-needed basis, such as by querying a social networkingservice with the user identification when needed.

A databus listener 110 detects when new confidential data is added tothe confidential information database 108 and triggers a workflow tohandle the new confidential data. First, the databus listener 110queries a thresholds data store 116 to determine if one or morethresholds for anonymization have been met. Specifically, until acertain number of data points for confidential data have been met, theconfidential data collection, tracking, and usage system 100 will notact upon any particular confidential data point. As will be described inmore detail later, these thresholds may be created on a per-slice basis.Each slice may define a segment of users about which insights may begathered based on data points from confidential data submitted by usersin the slice. For example, one slice may be users with the title“software engineer” located in the “San Francisco Bay Area.” If, forexample, the confidential data is compensation information, then it maybe determined that in order to gain useful insights into thecompensation information for a particular title in a particular region,at least ten data points (e.g., compensation information of tendifferent users) are needed. In this case, the threshold for “softwareengineer” located in “San Francisco Bay Area” may be set at ten. Thedatabus listener 110, therefore, is designed to retrieve theconfidential data added to the confidential information database 108,retrieve the threshold for the slice corresponding to attributes of theuser (as stored, for example, in the submission table in theconfidential information database 108 or retrieved at runtime from asocial networking service), determine if the new data point(s) cause thethreshold for the corresponding slice to be exceeded, and, if so, or ifthe threshold has already been exceeded, insert the data in a backendqueue 112 for extract, transform, and load (ETL) functions.

In an example embodiment, the thresholds data store 116 contains notjust the thresholds themselves but also a running count of how many datapoints have been received for each slice. In other words, the thresholdsdata store 116 indicates how close the slice is to having enough datapoints with which to provide insights. The databus listener 110 mayreference these counts when making its determination that a newlysubmitted data point causes a threshold to be exceeded. Running countsof data points received for each slice are updated in the thresholdsdata store 116 by the confidential data backend 106.

Since the databus listener 110 only transfers data points for aparticular slice to the backend queue 112 once the threshold for thatslice has been exceeded, the confidential data points corresponding tothat slice may need to be retrieved from the confidential informationdatabase 108 once the threshold is determined to be exceeded. Forexample, if, as above, the threshold for a particular slice is ten datapoints, the first nine data points received for that slice may simply beleft in the confidential information database 108 and not sent to thebackend queue 112. Then, when the tenth data point for the slice isstored in the confidential information database 108, the databuslistener 110 may determine that the threshold has been exceeded andretrieve all ten data points for the slice from the confidentialinformation database 108 and send them to the backend queue 112 forprocessing.

It should be noted that the information obtained by the databus listener110 from the confidential information database 108 and placed in thebackend queue 112 is anonymized. In an example embodiment, noidentification of the users who submitted the confidential data isprovided to the backend queue 112. Indeed, in some example embodiments,the information provided to the backend queue 112 may simply be theconfidential data itself and any information needed in order to properlygroup the confidential data in one or more slices. For example, ifslices are designed to group user confidential data based only on usertitle, location, and years of experience, other attributes for the userthat might have been stored in the confidential information database108, such as schools attended, may not be transferred to the backendqueue 112 when the confidential data tied to those attributes istransferred to the backend queue 112. This further helps to anonymizethe data, as it makes it more difficult for people to be able to deducethe identity of a user based on his or her attributes.

It should also be noted that any one piece of confidential data maycorrespond to multiple different slices, and thus the databus listener110 may, in some example embodiments, provide the same confidential datato the backend queue 112 multiple times. This can occur at differenttimes as well, because each of the slices may have its own thresholdthat may be transgressed at different times based on different counts.Thus, for example, compensation data for a user in the “San FranciscoBay Area” with a job title of “software developer” and a school attendedas “Stanford University” may be appropriately assigned to one slice ofsoftware developers in the San Francisco Bay Area, a slice of StanfordUniversity alums, and a slice of software developers in the UnitedStates. All slices may have their own thresholds and counts fromconfidential data from other users, who may or may not have completeoverlap with these three slices.

An ETL backend 114 acts to extract, transform, and load the confidentialdata to anonymize and group it and place it back in the confidentialinformation database 108 in a different location from that where it wasstored in non-anonymized form. It should be noted that in some exampleembodiments, the anonymization described above with respect to thedatabus listener 110 may actually be performed by the ETL backend 114.For example, the databus listener 110 may send non-anonymizedconfidential data along with all attributes to the backend queue 112,and it may be the ETL backend 114 that reviews this data and discardscertain elements of it to anonymize it.

In an example embodiment, the confidential information is stored inencrypted format in the confidential information database 108 when thedatabus listener 110 sends it to the backend queue 112. As such, onefunction of the ETL backend 114 is to decrypt the confidentialinformation. Encryption and decryption of the confidential data will bediscussed in more detail below.

The ETL backend 114 writes the anonymized confidential data and sliceinformation into an ETL table corresponding to the slice in theconfidential information database 108. As described earlier, this ETLtable may be stored in a different location than that in which theconfidential data was stored initially, such as the submission tabledescribed earlier.

At a later time, and perhaps using a batch or other periodic process,the information from the ETL table may be loaded in a distributed filesystem (DFS) 118. A confidential data relevance workflow 120 may thenextract relevant information from the DFS 118 and provide one or moreinsights into the relevant information in a confidential data insightsdata store 122. A confidential data relevance API 124 may then beutilized to provide insights from the confidential data insights datastore 122 to the confidential data frontend 104, which can then displaythem to a user. As described earlier, these insights may be providedonly on a “give-to-get” basis, namely that only users who provideconfidential information (and/or have provided it recently) can viewinsights.

Turning now to more detail about the submission process, FIGS. 2A-2C arescreen captures illustrating an example of a user interface 200 providedby the confidential data frontend 104, in accordance with an exampleembodiment. Referring first to FIG. 2A, the user interface 200 here isdepicted as a screen of a standalone application operating on a mobiledevice, such as a smartphone. In FIG. 2A, the user is prompted to entera base salary in a text box 202, with a drop-down menu providing optionsfor different time periods on which to measure the base salary (e.g.,per year, per month, per hour, etc.). Additionally, the user may beidentified by name at 204, the user's title may be identified at 206,and the user's current employer may be identified at 208. Thisinformation may be prepopulated into the user interface 200, such as byretrieving this information from a member profile for the user in asocial networking service. This eliminates the need for the user toenter this information manually, which can have the effect of dissuadingsome users from providing the confidential information or completing thesubmission process, especially on a mobile device where typing orotherwise entering information may be cumbersome.

Turning to FIG. 2B, here the user interface 200 displays a number ofother possible compensation types 210-220 from which the user canselect. Selecting one of these other possible compensation types 210-220causes the user interface 200 to provide an additional screen where theuser can submit confidential data regarding the selected compensationtype 210-220. Here, for example, the user has selected “Stock” 212.Referring now to FIG. 2C, the user interface 200 then switches to thisscreen, which allows the user to provide various specific details aboutstock compensation, such as restricted stock unit (RSU) compensation 222and options 224. The user interface 200 at this stage may also displaythe other compensation types 210-220 that the user can make additionalsubmissions for.

Referring back to FIG. 2B, when the user has completed entering all theconfidential data, such as all the different compensation typesappropriate for his or her current job, a “Get insights” button 226 maybe selected, which launches a process by which the confidential databackend 106 determines whether the user is eligible to receive insightsfrom confidential data from other users and, if so, indicates to theconfidential data backend 106 that the insights should be provided.Additionally, selection of the “Get insights” button 226 represents anindication that the submission of the confidential data by this user hasbeen completed, causing the confidential data backend 106 to store theconfidential data in the confidential information database 108 asdescribed below, which then may trigger the databus listener 110 toextract the confidential information and cause the ETL backend 114 toanonymize the confidential data and place it in the appropriate ETLtables corresponding to the appropriate slices in which the confidentialdata belongs. This permits the submitted confidential data to beavailable for future insights.

FIG. 3 is a flow diagram illustrating a method 300 for confidential datacollection and storage, in accordance with an example embodiment. In anexample embodiment, the method 300 may be performed by the confidentialdata backend 106 of FIG. 1. At operation 302, confidential data isobtained. At operation 304, an identification of the user who submittedthe confidential data is obtained. It should be noted that whileoperations 302 and 304 are listed separately, in some exampleembodiments they may be performed in the same operation. For example, inan example embodiment, the confidential data frontend 104 may, uponreceiving an indication from a user that input of confidential data inthe confidential data frontend 104 by the user has been completed,forward the inputted confidential data and an identification of the userto the confidential data backend 106. In other example embodiments,however, the operations 302 and 304 may be performed separately. Forexample, in an example embodiment, the identification of the user maynot be obtained directly from the confidential data frontend 104, butrather some other type of identifying information may be obtaineddirectly from the confidential data frontend 104, and this other type ofidentifying information may be used to query a social networking serviceor other third-party service for the identification information for theuser. Regardless, after operations 302 and 304 have been performed, theconfidential data backend 106 has at its disposal some confidential dataand identification information for the user who entered the confidentialdata.

It should be noted that the confidential data may be a single piece ofinformation, or may be multiple related pieces of information. Forexample, the confidential data may simply include a total compensationvalue and nothing more, or may include a complete breakdown of differenttypes of compensation (e.g., base salary, bonus, stock, etc.).

Users are understandably concerned about the security of theconfidential information, and specifically about a malicious user beingable to correlate the confidential information and the identification ofthe user (i.e., not just learning the confidential information but alsotying the confidential information specifically to the user). As such,at operation 306, the confidential data is encrypted using a first keyand stored in a first column of a submission table in a confidentialinformation database. Then, at operation 308, the identification of theuser who submitted the confidential data is separately encrypted using asecond key and stored in a second column of the submission table in theconfidential information database.

Additionally, a number of optional pieces of information may, in someexample embodiments, be stored in the submission table at this point. Atoperation 310, a timestamp of the submission of the confidential datamay be stored in a column in the submission table. This timestamp may beused in, for example, a determination of whether the user is eligible toreceive insights from confidential data submitted by other users. Atoperation 312, one or more attributes of the user may be stored as oneor more columns in the submission table. These attributes may be used,for example, in determining to which slice(s) the confidential data mayapply, as will be described in more detail below.

FIG. 4 is a diagram illustrating an example of a submission table 400,in accordance with an example embodiment. Each row in the submissiontable 400 corresponds to a different submission. Here, the submissiontable 400 includes five columns. In a first column 402, confidentialdata encrypted by a first key is stored. In a second column 404,identification of the user who submitted the corresponding confidentialdata, encrypted by a second key, is stored. In a third column 406, atimestamp for the submission is stored. In a fourth column 408, a firstattribute of the user, here location, is stored. In a fifth column 410,a second attribute of the user, here title, is stored. Of course, theremay be additional columns to store additional attributes or other piecesof information related to the submission.

Notably, FIG. 4 depicts an example embodiment where only the first andsecond columns 402, 404 are encrypted, using different encryption keys.In some example embodiments, the additional columns 406-410 may also beencrypted, either individually or together. In some example embodiments,one or more of these additional columns 406-410 may be encrypted usingthe same key as the first or second column 402, 404. Furthermore, insome example embodiments, the submission table 400 may be additionallyencrypted as a whole, using a third encryption key different from thekeys used to encrypt the first and second columns 402, 404.

It should be noted that while FIGS. 3 and 4 describe the confidentialdata as being stored in a single column in a submission table, in someexample embodiments, this column is actually multiple columns, ormultiple sub-columns, with each corresponding to a subset of theconfidential data. For example, if the confidential data is compensationinformation, the confidential data may actually comprise multipledifferent pieces of compensation information, such as base salary,bonus, stock, tips, and the like. Each of these pieces of compensationinformation may, in some example embodiments, have its own column in thesubmission table. Nevertheless, the processes described herein withregard to the “column” in which the confidential data is stored applyequally to the embodiments where multiple columns are used (e.g., theindividual pieces of compensation information are still encryptedseparately from the user identification information).

FIG. 5 is a flow diagram illustrating a method 500 for confidential datacollection and storage, in accordance with an example embodiment. Incontrast with FIG. 3, FIG. 5 represents an example embodiment where theconfidential data and the identification of the user who submitted theconfidential data are stored in separate tables in order to provideadditional security. At operation 502, confidential data is obtained. Atoperation 504, an identification of the user who submitted theconfidential data is obtained. As in FIG. 3, while operations 502 and504 are listed separately, in some example embodiments they may beperformed in the same operation.

At operation 506, a transaction identification is generated. Thistransaction identification may be, for example, a randomly generatednumber or character sequence that uniquely identifies the submission. Atoperation 508, the transaction identification may be encrypted using afirst key. At operation 510, the transaction information (eitherencrypted or not, depending upon whether operation 508 was utilized) isstored in a first column in a first submission table and in a firstcolumn in a second submission table in a confidential informationdatabase.

At operation 512, the confidential data is encrypted using a second keyand stored in a second column of the first submission table in theconfidential information database. Then, at operation 514, theidentification of the user who submitted the confidential data isseparately encrypted using a third key and stored in a second column ofthe second submission table in the confidential information database.

Additionally, as in FIG. 3, a number of optional pieces of informationmay, in some example embodiments, be stored in the first and/or secondsubmission tables at this point. At operation 516, a timestamp of thesubmission of the confidential data may be stored in a column in thesecond submission table. This timestamp may be used in, for example, adetermination of whether the user is eligible to receive insights fromconfidential data submitted by other users. At operation 518, one ormore attributes of the user may be stored as one or more columns in thesecond submission table. These attributes may be used, for example, indetermining to which slice(s) the confidential data may apply, as willbe described in more detail below. It should be noted that whileoperations 516 and 518 are described as placing information in thesecond submission table, in other example embodiments, one or more ofthese pieces of information may be stored in the first submission table.

If operation 508 is utilized, then the fact that the transactionidentification is encrypted and is the only mechanism by which to linkthe confidential data in the first submission table with the useridentification in the second submission table through a join operationprovides an additional layer of security.

FIGS. 6A-6C are screen captures illustrating a user interface 600 fordisplaying insights to a first user from confidential data submitted byother users, in accordance with an example embodiment. Referring firstto FIG. 6A, the user interface 600 displays a metric 602 comparingconfidential data of the first user to confidential data of other usersin a same slice as the first user. Here, for example, the first user isable to see that his base salary (as selectable via a drop-down menu604) is higher than that of 70% of other users in the same slice (theslice being depicted as User Experience Designers in the San FranciscoBay Area). This metric is also displayed as a graphic 606 for easycomparison.

Referring now to FIG. 6B, the user interface 600 displays salary rangesfor users in the same slice as the first user, including a median basesalary 608, a range of submitted base salaries 610, median totalcompensation 612, and a range of submitted total compensations 614.

Referring now to FIG. 6C, the user interface 600 displays insights 616,618, 620, and 622 for positions related to the position of the firstuser. Notably, these insights 616, 618, 620, and 622 may require usinginformation from slices other than the one the first user belongs to. Inan example embodiment, there is no limitation on the confidential datafrontend 104 retrieving insights from the confidential data insightsdata store 122 that come from slices different from ones to which theuser being presented with the insights belongs, although in some exampleembodiments, the confidential data frontend 104 may itself wish to limitthe first user's ability to ask for and/or view certain types ofinformation (e.g., the confidential data frontend 104 may permit thefirst user to view salary information for positions related to the firstuser's own position, but not unrelated positions).

As depicted above, all of the insights may be statistical informationderived from confidential data submitted by users other than the userviewing the insights (as well as potentially including the user's ownconfidential data as well).

Furthermore, in some example embodiments it may be desirable to displayinsights based on similar locations to either a member's currentlocation or a specified location. For example, a member could bepresented with salary information for cities that are similar to thecity that the member currently resides in, or some target city specifiedby the member.

In order to accomplish this, in an example embodiment, a directedweighted graph of location to location transitions is constructed. Eachnode in the directed weighted graph represents a location from which onemember of the social networking service either transitioned from or to(i.e., relocated). Each edge in the directed weighted graph indicatesthat a member relocated from a first location (the beginning of thedirected weighted graph) to a second location (the end of the directedweighted graph). Weights may be based on one or more of a variety ofdifferent factors, such as the number of members that made thisparticular transition, the fraction of members who made this transitioncompared to all members who resided in the first location, and atime-decay to give greater weight to more recent transitions. ALaplacian smoothing may then be introduced to address problems thatmight be caused by a small number of transitions. In an exampleembodiment, the Laplacian smoothing is dividing the numerator (number oftransitions) by the denominator (number of members who resided at firstlocation) plus some constant.

It should be noted that the term “resided in” shall be interpretedbroadly to cover any location in which the user spends a significantportion of time. This need not necessarily be the same as the place theuser lives. A place of work, for example, could also be considered aplace where the user “resides.”

The graph itself can be constructed at a number of different levels,including global/industry/function/title granularity. The graph can thenbe used to obtain the most similar locations for a given location, as afunction of the industry/job function/title, etc. In other words, thegraph may be constructed at the level at which the similaritydetermination should be conducted.

FIG. 7 is a flow diagram illustrating a method 700 of determiningsimilar locations to a first location based on transition information ina social networking service, in accordance with an example embodiment.At operation 702, a granularity of location similarity may bedetermined. The granularity of location similarity may be a set of oneor more filters to apply to social networking service data that resultsin only member data that satisfies the one or more filters being used.At operation 704, a weighted graph of location to location at thegranularity of location similarity is constructed, with each node in thegraph being a location, and a directed edge occurring from a first nodeto a second node if a transition occurred in the member data from alocation associated with the first node to a location associated withthe second node at the granularity of location similarity. At operation706, one or more weights may be applied to the directed edges. Atoperation 708, a Laplacian smoothing may be applied to the weights. Atoperation 710, the weighted directed graph is used to determine one ormore locations similar to a target location by finding the nodecorresponding to the target city and following the edges for any edgehaving a weight greater than a threshold value to find a similar city atthe other end of the edge. At operation 712, the similar locations areused to serve statistical insights to members based on submittedconfidential data from the members.

In some example embodiments, a more complex traversal of the weighteddirected graph may be utilized. For example, a personalized PageRankalgorithm walk may be performed to capture subsequent transitioninformation. For example, if users frequently transitioned from Fresnoto San Francisco and then subsequently transitioned to New York, thepersonalized PageRank algorithm would capture this and indicate asimilarity relationship between Fresno and New York, despite few or nodirect transitions from Fresno to New York.

Additionally, in some example embodiments, graphs at differentgranularities may be combined. This may be helpful when data is sparse.For example, if the granularity of the graph is at the title level, thedata may be quite sparse for many titles. A graceful fallback approachmay be utilized, where the selected level of granularity is attemptedand tested, and if data is deemed to be too sparse, a next higher levelof granularity is attempted and tested, and so on and so forth until, ifnecessary, the highest level of granularity (global) is utilized. In arelated alternative embodiment, if transitions for particular titles arenot sparse, then the data for those titles may be maintained at thetitle level while other titles are generalized to the next higher level.In other words, the lowest level of granularity that produces resultsfor individual entities may be selected on an entity-by-entity basis.

In another example embodiment, a weighted combination approach may beutilized, wherein graphs at different granularity levels are weighteddifferently and combined based on the weights.

In another example embodiment, a similar technique is used to computesimilar titles based on position transition data. Rather than a directedgraph where the nodes correspond to location, here the nodes correspondto titles. The edges of the directed graph represent transitions frompositions having one title to positions having another title. Weightsmay be based on one or more of a variety of different factors, such asthe number of members that made this particular transition, the fractionof members who made this transition compared to all members who held aposition with the first title, and a time-decay to give greater weightto more recent transitions. A Laplacian smoothing may then be introducedto address problems that might be caused by a small number oftransitions. In an example embodiment, the Laplacian smoothing isdividing the numerator (number of transitions) by the denominator(number of members who held a position with the first title) plus someconstant.

The graph itself can be constructed at a number of different levels,including global/industry/function/title granularity. The graph can thenbe used to obtain the most similar titles for a given title, as afunction of the industry/job function/title, etc. In other words, thegraph may be constructed at the level at which the similaritydetermination should be conducted.

FIG. 8 is a flow diagram illustrating a method 800 of determiningsimilar titles to a title based on transition information in a socialnetworking service, in accordance with an example embodiment. Atoperation 802, a granularity of title similarity may be determined. Thegranularity of title similarity may be a set of one or more filters toapply to social networking service data that results in only member datathat satisfies the one or more filters being used. At operation 804, aweighted graph of titles at the granularity of title similarity isconstructed, with each node in the graph being a title, and a directededge occurring from a first node to a second node if a transitionoccurred in the member data from a title associated with the first nodeto a title associated with the second node at the granularity of titlesimilarity. At operation 806, one or more weights may be applied to thedirected edges. At operation 808, a Laplacian smoothing may be appliedto the weights. At operation 810, the weighted directed graph is used todetermine one or more titles similar to a target title by finding thenode corresponding to the target title and following the edges for anyedge having a weight greater than a threshold value to find a similartitle at the other end of the edge. At operation 812, the similar titlesare used to serve statistical insights to members based on submittedconfidential data from the members.

In some example embodiments, a more complex traversal of the weighteddirected graph may be utilized. For example, a personalized PageRankalgorithm walk may be performed to capture subsequent transitioninformation. For example, if users frequently transitioned from softwareengineer to senior software engineer and then subsequently transitionedto product manager, the personalized PageRank algorithm would capturethis and indicate a similarity relationship between software engineerand product manager, despite few or no direct transitions from softwareengineer to product manager.

Additionally, in some example embodiments, graphs at differentgranularities may be combined. This may be helpful when data is sparse.For example, if the granularity of the graph is at the city level, thedata may be quite sparse for many titles. A graceful fallback approachmay be utilized, where the selected level of granularity is attemptedand tested, and if data is deemed to be too sparse, a next higher levelof granularity is attempted and tested, and so on and so forth until, ifnecessary, the highest level of granularity (global) is utilized. In arelated alternative embodiment, if transitions for particular cities arenot sparse, then the data for those cities may be maintained at the citylevel while other titles are generalized to the next higher level (e.g.,state). In other words, the lowest level of granularity that producesresults for individual entities may be selected on an entity-by-entitybasis.

In another example embodiment, a weighted combination approach may beutilized, wherein graphs at different granularity levels are weighteddifferently and combined based on the weights.

In another example embodiment, similar titles are computed based on acombination of three approaches. The first approach is the abovetechnique where a directed graph of title transitions is created andtraversed. The second involves generating a skills-based titlesimilarity graph where each title is represented as a weighted skillvector based on member profile data and job posting data. The edgeweights in this skills-based title similarity graph indicate asimilarity between corresponding vectors. This helps correct for issueswhere a job title itself might appear very similar to another due totransitions, but the underlying skills from the job titles are quitedifferent. For example, it might just be that in a certain city therewere a number of people who decided to give up software engineeringpositions to become artists. This graph would help identify that eventhough the number of transitions is significant, the skill sets aredifferent enough that the titles should not be considered to be similar.This can be performed using, for example, cosine similarity or Jaccardsimilarity techniques. The third involves identifying titles that havebeen coselected by an advertiser to target an ad or ad campaign, andforming a graph based on this information (with nodes corresponding totitles and edges corresponding to advertisers co-selecting the titles).Thus, the similarity between a first title and a second title is theprobability of being coselected compared to the probability of beingindividually selected. Finally, the outputs from these three graphs arecombined. The three graphs utilize the same set of nodes, with differentedges/edge weights. Combining the graphs then may involve combining allthe edges onto a single graph. The edges for the different graphs couldbe weighted based on the graphs they came from, or simply averaged.

This combination could also be performed based on phases of a traversaloperation. For example, one of the three graphs may be randomly selectedat each stage of a multi-stage traversal.

Alternatively, the similar titles could be calculated for each graphseparately and then the output similar titles could be combined.

FIG. 9 is a flow diagram illustrating a method 900 of determiningsimilar titles to a title in a social networking service, in accordancewith an example embodiment. At operation 902, a directed graph of titleswith edges indicating transitions in social networking data betweentitles is constructed. This may be performed as described above withrespect to operations 802-806 of FIG. 8 above. At operation 904, askills-based title similarity graph is constructed where each node is atitle having a weighted skill vector and the edges indicate a similaritybetween weighted skill vectors for corresponding nodes, based on memberprofile data and job posting data. At operation 906, a title advertisingcoselectivity graph is constructed where each node is a title and theedges are an indication that an advertiser coselected the correspondingtitles.

At operation 908, the directed graph of titles with edges indicatingtransitions, the skills-based title similarity graph, and the titleadvertising coselectivity graph are used to determine similar titles toa target title. As described above, this may be performed in a number ofdifferent ways. Each of the graphs could be separately traversed using atraversal technique, producing separate outputs which could then becombined into a single output. Alternatively, the graphs themselvescould be combined into a single graph, using either an average orweighted average for each graph, and that combined single graphtraversed using a traversal technique.

At operation 910, the similar titles are used to serve statisticalinsights to members based on submitted confidential data from themembers.

In some example embodiments, a more complex traversal of the weighteddirected graph may be utilized. For example, a personalized PageRankalgorithm walk may be performed to capture subsequent transitioninformation. For example, if users frequently transitioned from softwareengineer to senior software engineer and then subsequently transitionedto product manager, the personalized PageRank algorithm would capturethis and indicate a similarity relationship between software engineerand product manager, despite few or no direct transitions from softwareengineer to product manager.

Additionally, in some example embodiments, graphs at differentgranularities may be combined. This may be helpful when data is sparse.For example, if the granularity of the graph is at the city level, thedata may be quite sparse for many titles. A graceful fallback approachmay be utilized, where the selected level of granularity is attemptedand tested, and if data is deemed to be too sparse, a next higher levelof granularity is attempted and tested, and so on and so forth until, ifnecessary, the highest level of granularity (global) is utilized. In arelated alternative embodiment, if transitions for particular cities arenot sparse, then the data for those cities may be maintained at the citylevel while other titles are generalized to the next higher level (e.g.,state). In other words, the lowest level of granularity that producesresults for individual entities may be selected on an entity-by-entitybasis.

In another example embodiment, a weighted combination approach may beutilized, wherein graphs at different granularity levels are weighteddifferently and combined based on the weights.

In another example embodiment, a directed graph on transitioninformation is used to compute similar companies based on positiontransition data. Rather than a directed graph where the nodes correspondto location, here the nodes correspond to companies. The edges of thedirected graph represent transitions from company to company. Weightsmay be based on one or more of a variety of different factors, such asthe number of members that made this particular transition, the fractionof members who made this transition compared to all members who were atthe first company (at the beginning of the edge), and a time-decay togive greater weight to more recent transitions. A Laplacian smoothingmay then be introduced to address problems that might be caused by asmall number of transitions. In an example embodiment, the Laplaciansmoothing is dividing the numerator (number of transitions) by thedenominator (number of members who held a position in the first company)plus some constant.

The graph itself can be constructed at a number of different levels,including global/industry/location/function/title granularity. The graphcan then be used to obtain the most similar companies for a givencompany, as a function of the industry/job function/title/location, etc.In other words, the graph may be constructed at the level at which thesimilarity determination should be conducted.

FIG. 10 is a flow diagram illustrating a method 1000 of determiningsimilar companies to a target company based on transition information ina social networking service, in accordance with an example embodiment.At operation 1002, a granularity of company similarity may bedetermined. The granularity of company similarity may be a set of one ormore filters to apply to social networking service data that results inonly member data that satisfies the one or more filters being used. Atoperation 1004, a weighted graph of companies at the granularity ofcompany similarity is constructed, with each node in the graph being acompany, and a directed edge occurring from a first node to a secondnode if a transition occurred in the member data from a companyassociated with the first node to a company associated with the secondnode at the granularity of company similarity. At operation 1006, one ormore weights may be applied to the directed edges. At operation 1008, aLaplacian smoothing may be applied to the weights. At operation 1010,the weighted directed graph is used to determine one or more companiessimilar to a target company by finding the node corresponding to thetarget company group and following the edges for any edge having aweight greater than a threshold value to find a similar company at theother end of the edge. At operation 1012, the similar companies are usedto serve statistical insights to members based on submitted confidentialdata from the members.

In some example embodiments, a more complex traversal of the weighteddirected graph may be utilized. For example, a personalized PageRankalgorithm walk may be performed to capture subsequent transitioninformation. For example, if users frequently transitioned from asoftware company group to a hardware company group and then subsequentlytransitioned to an information technology company group, thepersonalized PageRank algorithm would capture this and indicate asimilarity relationship between the software and information technologycompany groups.

Additionally, in some example embodiments, graphs at differentgranularities may be combined. This may be helpful when data is sparse.For example, if the granularity of the graph is at the city level, thedata may be quite sparse for many company groups. A graceful fallbackapproach may be utilized, where the selected level of granularity isattempted and tested, and if data is deemed to be too sparse, a nexthigher level of granularity is attempted and tested, and so on and soforth until, if necessary, the highest level of granularity (global) isutilized. In a related alternative embodiment if transitions forparticular cities are not sparse then the data for those cities may bemaintained at the city level while other titles are generalized to thenext higher level (e.g., state). In other words, the lowest level ofgranularity that produces results for individual entities may beselected on an entity-by-entity basis.

In another example embodiment, a weighted combination approach may beutilized, wherein graphs at different granularity levels are weighteddifferently and combined based on the weights.

In another example embodiment, operation 912 may involve more complexanalyses using the weighted graph. Specifically, similar companies canbe grouped into three categories: (1) incoming companies; (2) outgoingcompanies; and (3) combined incoming and outgoing companies. An incomingcompany reflects a company from which member(s) transition to the targetcompany. An outgoing company reflects a company from which member(s)transitioned from the target company. A combined incoming and outgoingcompany reflects a company that both was an incoming and outgoingcompany with respect to the target company. The underlying confidentialdata, such as compensation information, that is served to members mayvary then depending upon which category of similar companies are mostrelevant. If a member is already working at a target company, the memberlikely will want to see compensation data for similar companies to whichmembers working at the target company transitioned. Alternatively, if amember is not working at a target company and, perhaps, the insight isgenerated based on a search specifying the target company, the memberwill likely want to see information on similar companies from whichmembers working at the target company transitioned from.

Alternatively, for compensation insights, companies in the incomingcompany category can be used as a lower bound for compensation insightswhereas companies in the outgoing company category can be used as anupper bound for compensation insights.

Modules, Components, and Logic

Certain embodiments are described herein as including logic or a numberof components, modules, or mechanisms. Modules may constitute eithersoftware modules (e.g., code embodied on a machine-readable medium) orhardware modules. A “hardware module” is a tangible unit capable ofperforming certain operations and may be configured or arranged in acertain physical manner. In various example embodiments, one or morecomputer systems (e.g., a standalone computer system, a client computersystem, or a server computer system) or one or more hardware modules ofa computer system (e.g., a processor or a group of processors) may beconfigured by software (e.g., an application or application portion) asa hardware module that operates to perform certain operations asdescribed herein.

In some embodiments, a hardware module may be implemented mechanically,electronically, or any suitable combination thereof. For example, ahardware module may include dedicated circuitry or logic that ispermanently configured to perform certain operations. For example, ahardware module may be a special-purpose processor, such as aField-Programmable Gate Array (FPGA) or an Application SpecificIntegrated Circuit (ASIC). A hardware module may also includeprogrammable logic or circuitry that is temporarily configured bysoftware to perform certain operations. For example, a hardware modulemay include software executed by a general-purpose processor or otherprogrammable processor. Once configured by such software, hardwaremodules become specific machines (or specific components of a machine)uniquely tailored to perform the configured functions and are no longergeneral-purpose processors. It will be appreciated that the decision toimplement a hardware module mechanically, in dedicated and permanentlyconfigured circuitry, or in temporarily configured circuitry (e.g.,configured by software) may be driven by cost and time considerations.

Accordingly, the phrase “hardware module” should be understood toencompass a tangible entity, be that an entity that is physicallyconstructed, permanently configured (e.g., hardwired), or temporarilyconfigured (e.g., programmed) to operate in a certain manner or toperform certain operations described herein. As used herein,“hardware-implemented module” refers to a hardware module. Consideringembodiments in which hardware modules are temporarily configured (e.g.,programmed), each of the hardware modules need not be configured orinstantiated at any one instance in time. For example, where a hardwaremodule comprises a general-purpose processor configured by software tobecome a special-purpose processor, the general-purpose processor may beconfigured as respectively different special-purpose processors (e.g.,comprising different hardware modules) at different times. Softwareaccordingly configures a particular processor or processors, forexample, to constitute a particular hardware module at one instance oftime and to constitute a different hardware module at a differentinstance of time.

Hardware modules can provide information to, and receive informationfrom, other hardware modules. Accordingly, the described hardwaremodules may be regarded as being communicatively coupled. Where multiplehardware modules exist contemporaneously, communications may be achievedthrough signal transmission (e.g., over appropriate circuits and buses)between or among two or more of the hardware modules. In embodiments inwhich multiple hardware modules are configured or instantiated atdifferent times, communications between such hardware modules may beachieved, for example, through the storage and retrieval of informationin memory structures to which the multiple hardware modules have access.For example, one hardware module may perform an operation and store theoutput of that operation in a memory device to which it iscommunicatively coupled. A further hardware module may then, at a latertime, access the memory device to retrieve and process the storedoutput. Hardware modules may also initiate communications with input oroutput devices, and can operate on a resource (e.g., a collection ofinformation).

The various operations of example methods described herein may beperformed, at least partially, by one or more processors that aretemporarily configured (e.g., by software) or permanently configured toperform the relevant operations. Whether temporarily or permanentlyconfigured, such processors may constitute processor-implemented modulesthat operate to perform one or more operations or functions describedherein. As used herein, “processor-implemented module” refers to ahardware module implemented using one or more processors.

Similarly, the methods described herein may be at least partiallyprocessor-implemented, with a particular processor or processors beingan example of hardware. For example, at least some of the operations ofa method may be performed by one or more processors orprocessor-implemented modules. Moreover, the one or more processors mayalso operate to support performance of the relevant operations in a“cloud computing” environment or as a “software as a service” (SaaS).For example, at least some of the operations may be performed by a groupof computers (as examples of machines including processors), with theseoperations being accessible via a network (e.g., the Internet) and viaone or more appropriate interfaces (e.g., an API).

The performance of certain of the operations may be distributed amongthe processors, not only residing within a single machine, but deployedacross a number of machines. In some example embodiments, the processorsor processor-implemented modules may be located in a single geographiclocation (e.g., within a home environment, an office environment, or aserver farm). In other example embodiments, the processors orprocessor-implemented modules may be distributed across a number ofgeographic locations.

Machine and Software Architecture

The modules, methods, applications, and so forth described inconjunction with FIGS. 1-10 are implemented in some embodiments in thecontext of a machine and an associated software architecture. Thesections below describe representative software architecture(s) andmachine (e.g., hardware) architecture(s) that are suitable for use withthe disclosed embodiments.

Software architectures are used in conjunction with hardwarearchitectures to create devices and machines tailored to particularpurposes. For example, a particular hardware architecture coupled with aparticular software architecture will create a mobile device, such as amobile phone, tablet device, or so forth. A slightly different hardwareand software architecture may yield a smart device for use in the“internet of things,” while yet another combination produces a servercomputer for use within a cloud computing architecture. Not allcombinations of such software and hardware architectures are presentedhere, as those of skill in the art can readily understand how toimplement the inventive subject matter in different contexts from thedisclosure contained herein.

Software Architecture

FIG. 11 is a block diagram 1100 illustrating a representative softwarearchitecture 1102, which may be used in conjunction with varioushardware architectures herein described. FIG. 11 is merely anon-limiting example of a software architecture, and it will beappreciated that many other architectures may be implemented tofacilitate the functionality described herein. The software architecture1102 may be executing on hardware such as a machine 1200 of FIG. 12 thatincludes, among other things, processors 1210, memory/storage 1230, andI/O components 1250. A representative hardware layer 1104 is illustratedand can represent, for example, the machine 1200 of FIG. 12. Therepresentative hardware layer 1104 comprises one or more processingunits 1106 having associated executable instructions 1108. Theexecutable instructions 1108 represent the executable instructions ofthe software architecture 1102, including implementation of the methods,modules, and so forth of FIGS. 1-10. The hardware layer 1104 alsoincludes memory and/or storage modules 1110, which also have theexecutable instructions 1108. The hardware layer 1104 may also compriseother hardware 1112, which represents any other hardware of the hardwarelayer 1104, such as the other hardware illustrated as part of themachine 1200.

In the example architecture of FIG. 11, the software architecture 1102may be conceptualized as a stack of layers where each layer providesparticular functionality. For example, the software architecture 1102may include layers such as an operating system 1114, libraries 1116,frameworks/middleware 1118, applications 1120, and a presentation layer1144. Operationally, the applications 1120 and/or other componentswithin the layers may invoke API calls 1124 through the software stackand receive responses, returned values, and so forth, illustrated asmessages 1126, in response to the API calls 1124. The layers illustratedare representative in nature and not all software architectures have alllayers. For example, some mobile or special-purpose operating systemsmay not provide a layer of frameworks/middleware 1118, while others mayprovide such a layer. Other software architectures may includeadditional or different layers.

The operating system 1114 may manage hardware resources and providecommon services. The operating system 1114 may include, for example, akernel 1128, services 1130, and drivers 1132. The kernel 1128 may act asan abstraction layer between the hardware and the other software layers.For example, the kernel 1128 may be responsible for memory management,processor management (e.g., scheduling), component management,networking, security settings, and so on. The services 1130 may provideother common services for the other software layers.

The drivers 1132 may be responsible for controlling or interfacing withthe underlying hardware. For instance, the drivers 1132 may includedisplay drivers, camera drivers, Bluetooth® drivers, flash memorydrivers, serial communication drivers (e.g., Universal Serial Bus (USB)drivers), Wi-Fi® drivers, audio drivers, power management drivers, andso forth depending on the hardware configuration.

The libraries 1116 may provide a common infrastructure that may beutilized by the applications 1120 and/or other components and/or layers.The libraries 1116 typically provide functionality that allows othersoftware modules to perform tasks in an easier fashion than byinterfacing directly with the underlying operating system 1114functionality (e.g., kernel 1128, services 1130, and/or drivers 1132).The libraries 1116 may include system libraries 1134 (e.g., C standardlibrary) that may provide functions such as memory allocation functions,string manipulation functions, mathematical functions, and the like. Inaddition, the libraries 1116 may include API libraries 1136 such asmedia libraries (e.g., libraries to support presentation andmanipulation of various media formats such as MPEG4, H.264, MP3, AAC,AMR, JPG, PNG), graphics libraries (e.g., an OpenGL framework that maybe used to render 2D and 3D graphic content on a display), databaselibraries (e.g., SQLite that may provide various relational databasefunctions), web libraries (e.g., WebKit that may provide web browsingfunctionality), and the like. The libraries 1116 may also include a widevariety of other libraries 1138 to provide many other APIs to theapplications 1120 and other software components/modules.

The frameworks 1118 (also sometimes referred to as middleware) mayprovide a higher-level common infrastructure that may be utilized by theapplications 1120 and/or other software components/modules. For example,the frameworks 1118 may provide various graphic user interface (GUI)functions, high-level resource management, high-level location services,and so forth. The frameworks 1118 may provide a broad spectrum of otherAPIs that may be utilized by the applications 1120 and/or other softwarecomponents/modules, some of which may be specific to a particularoperating system or platform.

The applications 1120 include built-in applications 1140 and/orthird-party applications 1142. Examples of representative built-inapplications 1140 may include, but are not limited to, a contactsapplication, a browser application, a book reader application, alocation application, a media application, a messaging application,and/or a game application. The third-party applications 1142 may includeany of the built-in applications 1140 as well as a broad assortment ofother applications. In a specific example, the third-party application1142 (e.g., an application developed using the Android™ or iOS™ softwaredevelopment kit (SDK) by an entity other than the vendor of theparticular platform) may be mobile software running on a mobileoperating system such as iOS™, Android™, Windows® Phone, or other mobileoperating systems. In this example, the third-party application 1142 mayinvoke the API calls 1124 provided by the mobile operating system suchas the operating system 1114 to facilitate functionality describedherein.

The applications 1120 may utilize built-in operating system 1114functions (e.g., kernel 1128, services 1130, and/or drivers 1132),libraries 1116 (e.g., system libraries 1134, API libraries 1136, andother libraries 1138), and frameworks/middleware 1118 to create userinterfaces to interact with users of the system. Alternatively, oradditionally, in some systems, interactions with a user may occurthrough a presentation layer, such as the presentation layer 1144. Inthese systems, the application/module “logic” can be separated from theaspects of the application/module that interact with a user.

Some software architectures utilize virtual machines. In the example ofFIG. 11, this is illustrated by a virtual machine 1148. A virtualmachine creates a software environment where applications/modules canexecute as if they were executing on a hardware machine (such as themachine 1200 of FIG. 12, for example). A virtual machine is hosted by ahost operating system (e.g., operating system 1114 in FIG. 11) andtypically, although not always, has a virtual machine monitor 1146,which manages the operation of the virtual machine 1148 as well as theinterface with the host operating system (e.g., operating system 1114).A software architecture executes within the virtual machine 1148, suchas an operating system 1150, libraries 1152, frameworks/middleware 1154,applications 1156, and/or a presentation layer 1158. These layers ofsoftware architecture executing within the virtual machine 1148 can bethe same as corresponding layers previously described or may bedifferent.

Example Machine Architecture and Machine-Readable Medium

FIG. 12 is a block diagram illustrating components of a machine 1200,according to some example embodiments, able to read instructions from amachine-readable medium (e.g., a machine-readable storage medium) andperform any one or more of the methodologies discussed herein.Specifically, FIG. 12 shows a diagrammatic representation of the machine1200 in the example form of a computer system, within which instructions1216 (e.g., software, a program, an application, an applet, an app, orother executable code) for causing the machine 1200 to perform any oneor more of the methodologies discussed herein may be executed. Theinstructions 1216 transform the general, non-programmed machine 1200into a particular machine 1200 programmed to carry out the described andillustrated functions in the manner described. In alternativeembodiments, the machine 1200 operates as a standalone device or may becoupled (e.g., networked) to other machines. In a networked deployment,the machine 1200 may operate in the capacity of a server machine or aclient machine in a server-client network environment, or as a peermachine in a peer-to-peer (or distributed) network environment. Themachine 1200 may comprise, but not be limited to, a server computer, aclient computer, a personal computer (PC), a tablet computer, a laptopcomputer, a netbook, a set-top box (STB), a personal digital assistant(PDA), an entertainment media system, a cellular telephone, a smartphone, a mobile device, a wearable device (e.g., a smart watch), a smarthome device (e.g., a smart appliance), other smart devices, a webappliance, a network router, a network switch, a network bridge, or anymachine capable of executing the instructions 1216, sequentially orotherwise, that specify actions to be taken by the machine 1200.Further, while only a single machine 1200 is illustrated, the term“machine” shall also be taken to include a collection of machines 1200that individually or jointly execute the instructions 1216 to performany one or more of the methodologies discussed herein.

The machine 1200 may include processors 1210, memory/storage 1230, andI/O components 1250, which may be configured to communicate with eachother such as via a bus 1202. In an example embodiment, the processors1210 (e.g., a Central Processing Unit (CPU), a Reduced Instruction SetComputing (RISC) processor, a Complex Instruction Set Computing (CISC)processor, a Graphics Processing Unit (GPU), a Digital Signal Processor(DSP), an ASIC, a Radio-Frequency Integrated Circuit (RFIC), anotherprocessor, or any suitable combination thereof) may include, forexample, a processor 1212 and a processor 1214 that may execute theinstructions 1216. The term “processor” is intended to includemulti-core processors that may comprise two or more independentprocessors (sometimes referred to as “cores”) that may execute theinstructions 1216 contemporaneously. Although FIG. 12 shows multipleprocessors 1210, the machine 1200 may include a single processor with asingle core, a single processor with multiple cores (e.g., a multi-coreprocessor), multiple processors with a single core, multiple processorswith multiples cores, or any combination thereof.

The memory/storage 1230 may include a memory 1232, such as a mainmemory, or other memory storage, and a storage unit 1236, bothaccessible to the processors 1210 such as via the bus 1202. The storageunit 1236 and memory 1232 store the instructions 1216 embodying any oneor more of the methodologies or functions described herein. Theinstructions 1216 may also reside, completely or partially, within thememory 1232, within the storage unit 1236, within at least one of theprocessors 1210 (e.g., within the processor's cache memory), or anysuitable combination thereof, during execution thereof by the machine1200. Accordingly, the memory 1232, the storage unit 1236, and thememory of the processors 1210 are examples of machine-readable media.

As used herein, “machine-readable medium” means a device able to storeinstructions and data temporarily or permanently and may include, but isnot limited to, random-access memory (RAM), read-only memory (ROM),buffer memory, flash memory, optical media, magnetic media, cachememory, other types of storage (e.g., Erasable Programmable Read-OnlyMemory (EEPROM)), and/or any suitable combination thereof. The term“machine-readable medium” should be taken to include a single medium ormultiple media (e.g., a centralized or distributed database, orassociated caches and servers) able to store the instructions 1216. Theterm “machine-readable medium” shall also be taken to include anymedium, or combination of multiple media, that is capable of storinginstructions (e.g., instructions 1216) for execution by a machine (e.g.,machine 1200), such that the instructions, when executed by one or moreprocessors of the machine (e.g., processors 1210), cause the machine toperform any one or more of the methodologies described herein.Accordingly, a “machine-readable medium” refers to a single storageapparatus or device, as well as “cloud-based” storage systems or storagenetworks that include multiple storage apparatus or devices. The term“machine-readable medium” excludes signals per se.

The I/O components 1250 may include a wide variety of components toreceive input, provide output, produce output, transmit information,exchange information, capture measurements, and so on. The specific I/Ocomponents 1250 that are included in a particular machine will depend onthe type of machine. For example, portable machines such as mobilephones will likely include a touch input device or other such inputmechanisms, while a headless server machine will likely not include sucha touch input device. It will be appreciated that the I/O components1250 may include many other components that are not shown in FIG. 12.The I/O components 1250 are grouped according to functionality merelyfor simplifying the following discussion and the grouping is in no waylimiting. In various example embodiments, the I/O components 1250 mayinclude output components 1252 and input components 1254. The outputcomponents 1252 may include visual components (e.g., a display such as aplasma display panel (PDP), a light emitting diode (LED) display, aliquid crystal display (LCD), a projector, or a cathode ray tube (CRT)),acoustic components (e.g., speakers), haptic components (e.g., avibratory motor, resistance mechanisms), other signal generators, and soforth. The input components 1254 may include alphanumeric inputcomponents (e.g., a keyboard, a touch screen configured to receivealphanumeric input, a photo-optical keyboard, or other alphanumericinput components), point based input components (e.g., a mouse, atouchpad, a trackball, a joystick, a motion sensor, or another pointinginstrument), tactile input components (e.g., a physical button, a touchscreen that provides location and/or force of touches or touch gestures,or other tactile input components), audio input components (e.g., amicrophone), and the like.

In further example embodiments, the I/O components 1250 may includebiometric components 1256, motion components 1258, environmentalcomponents 1260, or position components 1262, among a wide array ofother components. For example, the biometric components 1256 may includecomponents to detect expressions (e.g., hand expressions, facialexpressions, vocal expressions, body gestures, or eye tracking), measurebiosignals (e.g., blood pressure, heart rate, body temperature,perspiration, or brain waves), identify a person (e.g., voiceidentification, retinal identification, facial identification,fingerprint identification, or electroencephalogram basedidentification), and the like. The motion components 1258 may includeacceleration sensor components (e.g., accelerometer), gravitation sensorcomponents, rotation sensor components (e.g., gyroscope), and so forth.The environmental components 1260 may include, for example, illuminationsensor components (e.g., photometer), temperature sensor components(e.g., one or more thermometers that detect ambient temperature),humidity sensor components, pressure sensor components (e.g.,barometer), acoustic sensor components (e.g., one or more microphonesthat detect background noise), proximity sensor components (e.g.,infrared sensors that detect nearby objects), gas sensors (e.g., gasdetection sensors to detect concentrations of hazardous gases for safetyor to measure pollutants in the atmosphere), or other components thatmay provide indications, measurements, or signals corresponding to asurrounding physical environment. The position components 1262 mayinclude location sensor components (e.g., a Global Position System (GPS)receiver component), altitude sensor components (e.g., altimeters orbarometers that detect air pressure from which altitude may be derived),orientation sensor components (e.g., magnetometers), and the like.

Communication may be implemented using a wide variety of technologies.The I/O components 1250 may include communication components 1264operable to couple the machine 1200 to a network 1280 or devices 1270via a coupling 1282 and a coupling 1272, respectively. For example, thecommunication components 1264 may include a network interface componentor other suitable device to interface with the network 1280. In furtherexamples, the communication components 1264 may include wiredcommunication components, wireless communication components, cellularcommunication components, Near Field Communication (NFC) components,Bluetooth® components (e.g., Bluetooth® Low Energy), Wi-Fi® components,and other communication components to provide communication via othermodalities. The devices 1270 may be another machine or any of a widevariety of peripheral devices (e.g., a peripheral device coupled via aUSB).

Moreover, the communication components 1264 may detect identifiers orinclude components operable to detect identifiers. For example, thecommunication components 1264 may include Radio Frequency Identification(RFID) tag reader components, NFC smart tag detection components,optical reader components (e.g., an optical sensor to detectone-dimensional bar codes such as Universal Product Code (UPC) bar code,multi-dimensional bar codes such as Quick Response (QR) code, Azteccode, Data Matrix, Dataglyph, MaxiCode, PDF417, Ultra Code, UCC RSS-2Dbar code, and other optical codes), or acoustic detection components(e.g., microphones to identify tagged audio signals). In addition, avariety of information may be derived via the communication components1264, such as location via Internet Protocol (IP) geolocation, locationvia Wi-Fi® signal triangulation, location via detecting an NFC beaconsignal that may indicate a particular location, and so forth.

Transmission Medium

In various example embodiments, one or more portions of the network 1280may be an ad hoc network, an intranet, an extranet, a virtual privatenetwork (VPN), a local area network (LAN), a wireless LAN (WLAN), a widearea network (WAN), a wireless WAN (WWAN), a metropolitan area network(MAN), the Internet, a portion of the Internet, a portion of the PublicSwitched Telephone Network (PSTN), a plain old telephone service (POTS)network, a cellular telephone network, a wireless network, a Wi-Fi®network, another type of network, or a combination of two or more suchnetworks. For example, the network 1280 or a portion of the network 1280may include a wireless or cellular network and the coupling 1282 may bea Code Division Multiple Access (CDMA) connection, a Global System forMobile communications (GSM) connection, or another type of cellular orwireless coupling. In this example, the coupling 1282 may implement anyof a variety of types of data transfer technology, such as SingleCarrier Radio Transmission Technology (1×RTT), Evolution-Data Optimized(EVDO) technology, General Packet Radio Service (GPRS) technology,Enhanced Data rates for GSM Evolution (EDGE) technology, thirdGeneration Partnership Project (3GPP) including 3G, fourth generationwireless (4G) networks, Universal Mobile Telecommunications System(UMTS), High Speed Packet Access (HSPA), Worldwide Interoperability forMicrowave Access (WiMAX), Long Term Evolution (LTE) standard, othersdefined by various standard-setting organizations, other long rangeprotocols, or other data transfer technology.

The instructions 1216 may be transmitted or received over the network1280 using a transmission medium via a network interface device (e.g., anetwork interface component included in the communication components1264) and utilizing any one of a number of well-known transfer protocols(e.g., Hypertext Transfer Protocol (HTTP)). Similarly, the instructions1216 may be transmitted or received using a transmission medium via thecoupling 1272 (e.g., a peer-to-peer coupling) to the devices 1270. Theterm “transmission medium” shall be taken to include any intangiblemedium that is capable of storing, encoding, or carrying theinstructions 1216 for execution by the machine 1200, and includesdigital or analog communications signals or other intangible media tofacilitate communication of such software.

Language

Throughout this specification, plural instances may implementcomponents, operations, or structures described as a single instance.Although individual operations of one or more methods are illustratedand described as separate operations, one or more of the individualoperations may be performed concurrently, and nothing requires that theoperations be performed in the order illustrated. Structures andfunctionality presented as separate components in example configurationsmay be implemented as a combined structure or component. Similarly,structures and functionality presented as a single component may beimplemented as separate components. These and other variations,modifications, additions, and improvements fall within the scope of thesubject matter herein.

Although an overview of the inventive subject matter has been describedwith reference to specific example embodiments, various modificationsand changes may be made to these embodiments without departing from thebroader scope of embodiments of the present disclosure. Such embodimentsof the inventive subject matter may be referred to herein, individuallyor collectively, by the term “invention” merely for convenience andwithout intending to voluntarily limit the scope of this application toany single disclosure or inventive concept if more than one is, in fact,disclosed.

The embodiments illustrated herein are described in sufficient detail toenable those skilled in the art to practice the teachings disclosed.Other embodiments may be used and derived therefrom, such thatstructural and logical substitutions and changes may be made withoutdeparting from the scope of this disclosure. The Detailed Description,therefore, is not to be taken in a limiting sense, and the scope ofvarious embodiments is defined only by the appended claims, along withthe full range of equivalents to which such claims are entitled.

As used herein, the term “or” may be construed in either an inclusive orexclusive sense. Moreover, plural instances may be provided forresources, operations, or structures described herein as a singleinstance. Additionally, boundaries between various resources,operations, modules, engines, and data stores are somewhat arbitrary,and particular operations are illustrated in a context of specificillustrative configurations. Other allocations of functionality areenvisioned and may fall within a scope of various embodiments of thepresent disclosure. In general, structures and functionality presentedas separate resources in the example configurations may be implementedas a combined structure or resource. Similarly, structures andfunctionality presented as a single resource may be implemented asseparate resources. These and other variations, modifications,additions, and improvements fall within a scope of embodiments of thepresent disclosure as represented by the appended claims. Thespecification and drawings are, accordingly, to be regarded in anillustrative rather than a restrictive sense.

What is claimed is:
 1. A system comprising: a non-transitorycomputer-readable medium having instructions stored thereon, which, whenexecuted by a processor, cause the system to: determine a granularity oftitle similarity, wherein the granularity of title similarity is a levelat which social networking data should be filtered to identify titlessimilar to a target title; construct a weighted graph of titles at thegranularity of title similarity, wherein each node in the weighted graphis a title and a directed edge exists in the weighted graph between afirst node and a second node if the social networking data, at thegranularity of title similarity, indicates that a transition occurredwherein a member who held a position with a title corresponding to thefirst node transitioned to a position with a title corresponding to thesecond node, wherein each directed edge contains a weight indicating astrength of relationship between nodes; and traverse the weighted graphof locations from a node corresponding to the target title in order toidentify titles similar to the target title, wherein the traversingincluding finding a node corresponding to the target title and followingedges for any edge having a weight greater than a threshold value tofind a similar title at another end of the followed edge; retrieve, froman external data source, one or more confidential data values havingbeen entered on screens of a first set of one or more graphical userinterfaces and encrypted on the external data source, the one or moreconfidential data values having attributes matching the identifiedtitles similar to the target title; and present informationcorresponding to the retrieved one or more confidential data values in asecond set of one or more graphical user interfaces.
 2. The system ofclaim 1, wherein the weight for each edge in the directed graph is basedon a number of members who transitioned between a first position havinga title corresponding to a node at the beginning of the edge to a secondposition having a title corresponding to a node at the end of the edge.3. The system of claim 1, wherein the weight for each edge in thedirected graph is based on a number of members who transitioned betweena first position having a title corresponding to a node at the beginningof the edge to a second position having a title corresponding to a nodeat the end of the edge divided by a total number of members who had aposition having a title corresponding to the node at the beginning ofthe edge.
 4. The system of claim 1, wherein the instructions furthercause the system to perform an laplacian smoothing to the weights of theedges.
 5. The system of claim 1, wherein the weight for each edge in thedirected graph is based at least in part on recentness of transitionsbetween positions.
 6. The system of claim 1, wherein the traversingincludes performing a graceful fallback traversal wherein thegranularity of title similarity is gradually stepped up level by levelif a particular granularity results in too sparse social networkingdata.
 7. A method comprising: determining a granularity of titlesimilarity, wherein the granularity of title similarity is a level atwhich social networking data should be filtered to identify titlessimilar to a target title; constructing a weighted graph of titles atthe granularity of title similarity, wherein each node in the weightedgraph is a title and a directed edge exists in the weighted graphbetween a first node and a second node if the social networking data, atthe granularity of title similarity, indicates that a transitionoccurred wherein a member who held a position with a title correspondingto the first node transitioned to a position with a title correspondingto the second node, wherein each directed edge contains a weightindicating a strength of relationship between nodes; and traversing theweighted graph of locations from a node corresponding to the targettitle in order to identify titles similar to the target title, whereinthe traversing including finding a node corresponding to the targettitle and following edges for any edge having a weight greater than athreshold value to find a similar title at another end of the followededge; retrieving, from an external data source, one or more confidentialdata values having been entered on screens of a first set of one or moregraphical user interfaces and encrypted on the external data source, theone or more confidential data values having attributes matching theidentified titles similar to the target title; and presentinginformation corresponding to the retrieved one or more confidential datavalues in a second set of one or more graphical user interfaces.
 8. Themethod of claim 7, wherein the weight for each edge in the directedgraph is based on a number of members who transitioned between a firstposition having a title corresponding to a node at the beginning of theedge to a second position having a title corresponding to a node at theend of the edge.
 9. The method of claim 7, wherein the weight for eachedge in the directed graph is based on a number of members whotransitioned between a first position having a title corresponding to anode at the beginning of the edge to a second position having a titlecorresponding to a node at the end of the edge divided by a total numberof members who had a position having a title corresponding to the nodeat the beginning of the edge.
 10. The method of claim 7, furthercomprising performing an laplacian smoothing to the weights of theedges.
 11. The method of claim 7, wherein the weight for each edge inthe directed graph is based at least in part on recentness oftransitions between positions.
 12. The method of claim 7, wherein thetraversing includes performing a graceful fallback traversal wherein thegranularity of title similarity is gradually stepped up level by levelif a particular granularity results in too sparse social networkingdata.
 13. A non-transitory machine-readable storage medium comprisinginstructions, which when implemented by one or more machines, cause theone or more machines to perform operations comprising: determining agranularity of title similarity, wherein the granularity of titlesimilarity is a level at which social networking data should be filteredto identify titles similar to a target title; constructing a weightedgraph of titles at the granularity of title similarity, wherein eachnode in the weighted graph is a title and a directed edge exists in theweighted graph between a first node and a second node if the socialnetworking data, at the granularity of title similarity, indicates thata transition occurred wherein a member who held a position with a titlecorresponding to the first node transitioned to a position with a titlecorresponding to the second node, wherein each directed edge contains aweight indicating a strength of relationship between nodes; andtraversing the weighted graph of locations from a node corresponding tothe target title in order to identify titles similar to the targettitle, wherein the traversing including finding a node corresponding tothe target title and following edges for any edge having a weightgreater than a threshold value to find a similar title at another end ofthe followed edge; retrieving, from an external data source, one or moreconfidential data values having been entered on screens of a first setof one or more graphical user interfaces and encrypted on the externaldata source, the one or more confidential data values having attributesmatching the identified titles similar to the target title; andpresenting information corresponding to the retrieved one or moreconfidential data values in a second set of one or more graphical userinterfaces.
 14. The non-transitory machine-readable storage medium ofclaim 13, wherein the weight for each edge in the directed graph isbased on a number of members who transitioned between a first positionhaving a title corresponding to a node at the beginning of the edge to asecond position having a title corresponding to a node at the end of theedge.
 15. The non-transitory machine-readable storage medium of claim13, wherein the weight for each edge in the directed graph is based on anumber of members who transitioned between a first position having atitle corresponding to a node at the beginning of the edge to a secondposition having a title corresponding to a node at the end of the edgedivided by a total number of members who had a position having a titlecorresponding to the node at the beginning of the edge.
 16. Thenon-transitory machine-readable storage medium of claim 13, wherein theinstructions further cause the system to perform an laplacian smoothingto the weights of the edges.
 17. The non-transitory machine-readablestorage medium of claim 13, wherein the weight for each edge in thedirected graph is based at least in part on recentness of transitionsbetween positions.
 18. The non-transitory machine-readable storagemedium of claim 13, wherein the traversing includes performing agraceful fallback traversal wherein the granularity of title similarityis gradually stepped up level by level if a particular granularityresults in too sparse social networking data.